In this video we will learn about Quick sort algorithm which like Merge sort algorithm uses recursive approach to sort a given unsorted array. In this video I will be showing you Quick sort not in code but in ion. Are you ready to know how quick sort works?\r<br>\r<br>Quick Sort code link\r<br>\r<br>\r<br>0:04 Introduction to Quick Sort\r<br>0:22 The 3 recursive steps followed in Quick Sort\r<br>0:40 Explaining Quick Sort with a simple example\r<br>0:55 Initially we take an unsorted array\r<br>1:00 We take 3 variables left, right and pivot\r<br>1:22 The Quick Sort Rule\r<br>4:10 The first pivot is 5\r<br>5:50 The second pivot is 4\r<br>6:55 The third pivot is 1\r<br>7:46 The fourth pivot is 2\r<br>8:10 The fifth pivot is 3\r<br>8:42 The sixth pivot is 6\r<br>8:55 The array is sorted!\r<br>9:01 About Quick Sort\r<br>9:16 Algorithm of Quick Sort\r<br>9:44 Order of Quick Sort\r<br>\r<br>\r<br>You can download the source code from my GitHub repository\r<br>\r<br>\r<br>Complete Playlist\r<br>\r<br>\r<br>Related Videos:\r<br>Bubble Sort \r<br>Selection Sort \r<br>Insertion Sort \r<br>Merge Sort \r<br>Merging Algorithm \r<br>Pseudo code
